A sequential quadratic Hamiltonian scheme to compute optimal relaxed controls

نویسندگان

چکیده

A new sequential quadratic Hamiltonian method for computing optimal relaxed controls a class of control problems governed by ordinary differential equations is presented. This iterative approach based on the characterisation means Pontryagin maximum principle in framework Young measures, and it belongs to family successive approximations schemes. The ability proposed optimisation solve with regular controls, including cases oscillations concentration effects, demonstrated results numerical experiments. In all cases, scheme appears robust efficient, agreement convergence theoretical investigation presented this paper.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compute Censored Empirical Likelihood Ratio by Sequential Quadratic Programming

Empirical likelihood ratio method (Thomas and Grunkmier 1975, Owen 1988, 1990, 2001) is a general nonparametric inference procedure that has many nice properties. Recently the procedure has been shown to also work with censored data with various parameters and the nice properties also hold there. But the computation of the empirical likelihood ratios with censored data and/or complex setting is...

متن کامل

Sequential Linear Quadratic Optimal Control for Nonlinear Switched Systems

In this contribution, we introduce an efficient method for solving the optimal control problem for an unconstrained nonlinear switched system with an arbitrary cost function. We assume that the sequence of the switching modes are given but the switching time in between consecutive modes remains to be optimized. The proposed method uses a two-stage approach as introduced by Xu and Antsaklis (200...

متن کامل

Quadratic Algebras Related to the Bi - Hamiltonian

We prove the conjectures on dimensions and characters of some quadratic algebras stated by B.L.Feigin. It turns out that these algebras are naturally isomorphic to the duals of the components of the bi-Hamiltonian operad.

متن کامل

An Optimal Sequential Algorithm to Compute All Hinge Vertices on Circular-Arc Graphs

The distance between at least two vertices of a network becomes longer after the removal of a hinge vertex. Thus a faulty hinge vertex will increase the overall communication cost in a network. Therefore, finding the set of all hinge vertices in a graph can be used to identify the critical nodes in a real network. In this paper, an algorithm is presented to find hinge vertices of a circular-arc...

متن کامل

a benchmarking approach to optimal asset allocation for insurers and pension funds

uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations

سال: 2021

ISSN: ['1262-3377', '1292-8119']

DOI: https://doi.org/10.1051/cocv/2021041